Density of universal classes of series-parallel graphs
نویسندگان
چکیده
منابع مشابه
Density of universal classes of series-parallel graphs
A class of graphs C ordered by the homomorphism relation is universal if every countable partial order can be embedded in C. It was shown in [1] that the class Ck of k-colorable graphs, for any fixed k ≥ 3, induces a universal partial order. In [4], a surprisingly small subclass of C3 which is a proper subclass of K4-minor-free graphs (G/K4) is shown to be universal. In another direction, a den...
متن کاملAgeing Orders of Series-Parallel and Parallel-Series Systems with Independent Subsystems Consisting of Dependent Components
In this paper, we consider series-parallel and parallel-series systems with independent subsystems consisting of dependent homogeneous components whose joint lifetimes are modeled by an Archimedean copula. Then, by considering two such systems with different numbers of components within each subsystem, we establish hazard rate and reversed hazard rate orderings between the two system lifetimes,...
متن کاملParallel Recognition of Series-Parallel Graphs
Recently, He and Yesha gave an algorithm for recognizing directed series parallel graphs, in time O(log n) with linearly many EREW processors. We give a new algorithm for this problem, based on a structural characterization of series parallel graphs in terms of their ear decompositions. Our algorithm can recognize undirected as well as directed series parallel graphs. It can be implemented in t...
متن کاملParallel Decomposition of Generalized Series-Parallel Graphs
Received July 17, 1997; accepted May 1, 1998. Communicated by Wen-Lian Hsu. *A preliminary version of this paper appeared in the proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’97) Las Vegas, Nevada, pp. 890-896, 1997. Research supported in part by NSC under Grant 83-0408-E-008-004. JOURNAL OF INFORMATION SCIENCE AND ENGINEER...
متن کاملBoxicity of series-parallel graphs
The three well-known graph classes, planar graphs(P), series-parallel graphs (SP) and outer planar graphs(OP) satisfy the following proper inclusion relation: OP ⊂ SP ⊂ P . It is known that box(G) ≤ 3 if G ∈ P and box(G) ≤ 2 if G ∈ OP . Thus it is interesting to decide whether the maximum possible value of the boxicity of series-parallel graphs is 2 or 3. In this paper we construct a series-par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2006
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.20182